The equational theory of regular words

Duality and Equational Theory of Regular Languages

In their more general form, our equations are of the form u → v, where u and v are profinite words. The first result not only subsumes Eilenberg-Reiterman’s theory of varieties and their subsequent extensions, but it shows for instance that any class of regular languages defined by a fragment of logic closed under conjunctions and disjunctions (first order, monadic second order, temporal, etc.)...

Duality and the equational theory of regular languages

On one hand, the Eilenberg variety theorem establishes a bijective correspondence between varieties of formal languages and varieties of finite monoids. On the other hand, the Reiterman theorem states that varieties of finite monoids are exactly the classes of finite monoids definable by profinite equations. Together these two theorems give a structural insight in the algebraic theory of finite...

the analysis of the role of the speech acts theory in translating and dubbing hollywood films

از محوری ترین اثراتی که یک فیلم سینمایی ایجاد می کند دیالوگ هایی است که هنرپیش گان فیلم میگویند. به زعم یک فیلم ساز, یک شیوه متأثر نمودن مخاطب از اثر منظوره نیروی گفتارهای گوینده, مثل نیروی عاطفی, ترس آور, غم انگیز, هیجان انگیز و غیره, است. این مطالعه به بررسی این مسأله مبادرت کرده است که آیا نیروی فراگفتاری هنرپیش گان به مثابه ی اعمال گفتاری در پنج فیلم هالیوودی در نسخه های دوبله شده باز تولید...

The Equational Theory of Pomsets

Pomsets have been introduced as a mode2 of concurrency. Since a pomset is a string in which the total order has been relaxed to be a partial order, in this paper we view them as a generalization cf Strings, and investigate their algebraic properties. In particular, we investigate the axiomatic properties of pornsets, sets of pomsets and ideals of pornsets, under such operations as concatenation...

Universal Unification and Regular Equational ACFM Theories